A hyper-heuristic for distributed parallel machine scheduling with machine-dependent processing and sequence-dependent setup times
نویسندگان
چکیده
Today, because the market is scattered around world, manufacturing activities are not limited to a single location and have spread globally. As result, discussion of scheduling factory has changed from classic network as need in real world. In this regard, study considers multiple factories by taking into account job transportation time between factories. The main problem here that each would be assigned which machine. research, unrelated parallel machines considered processing jobs depends on machine setup time. To minimize makespan, first, mixed-integer linear model was proposed two types modeling been combined. Then, hyper-heuristic algorithm (HHA) designed solve reasonable choosing best method among four low-level heuristic methods precisely according properties problem. Finally, efficiency compared with imperialist competitive (ICA) conducting experiments. results show performs very well ICA and, more than 75% test problems, superior. Also, based analysis, comparing ICA, it can concluded there significant difference results, all cases, HHA remarkably better. Considering challenges rapid changes today’s traditional centralized production planning does enough flexibility respond them, research expected useful attractive for planners field.
منابع مشابه
Non-Identical Parallel Machine Scheduling with Sequence and Machine Dependent Setup Times Using Meta-Heuristic Algorithms
This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain opt...
متن کاملComparing Meta-Heuristic Approaches for Parallel Machine Scheduling Problems with Sequence Dependent Setup Times
متن کامل
A fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2022
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2022194